0.10/0.18	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.19	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.42	% Computer   : n013.cluster.edu
0.13/0.42	% Model      : x86_64 x86_64
0.13/0.42	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.42	% Memory     : 8042.1875MB
0.13/0.42	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.42	% CPULimit   : 1200
0.13/0.42	% WCLimit    : 120
0.13/0.42	% DateTime   : Tue Jul 13 10:08:33 EDT 2021
0.20/0.42	% CPUTime    : 
0.20/0.42	% Number of cores: 8
0.20/0.42	% Python version: Python 3.6.8
0.20/0.42	# Version: 2.6rc1-ho
0.20/0.43	# No SInE strategy applied
0.20/0.43	# Trying AutoSched0 for 59 seconds
59.12/59.44	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S049N
59.12/59.44	# and selection function PSelectComplexPreferEQ.
59.12/59.44	#
59.12/59.44	# Preprocessing time       : 0.033 s
59.12/59.44	# Presaturation interreduction done
59.23/59.52	# No success with AutoSched0
59.23/59.52	# Trying AutoSched1 for 26 seconds
59.28/59.61	# AutoSched1-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
59.28/59.61	# and selection function PSelectComplexExceptUniqMaxHorn.
59.28/59.61	#
59.28/59.61	# Preprocessing time       : 0.034 s
59.28/59.61	# Presaturation interreduction done
59.28/59.61	
59.28/59.61	# Proof found!
59.28/59.61	# SZS status Theorem
59.28/59.61	# SZS output start CNFRefutation
59.28/59.61	thf(replAx, axiom, (replAx<=>![X6:$i > $i > $o, X4:$i]:(![X2:$i]:(in @ X2 @ X4=>exu @ (^[X3:$i]:X6 @ X2 @ X3))=>?[X5:$i]:![X2:$i]:(in @ X2 @ X5<=>?[X3:$i]:(in @ X3 @ X4&X6 @ X3 @ X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', replAx)).
59.28/59.61	thf(exu, axiom, (exu)=(^[X1:$i > $o]:?[X2:$i]:(X1 @ X2&![X3:$i]:(X1 @ X3=>(X2)=(X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', exu)).
59.28/59.61	thf(descrp, axiom, (descrp<=>![X1:$i > $o]:(exu @ (^[X2:$i]:X1 @ X2)=>X1 @ (descr @ (^[X2:$i]:X1 @ X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', descrp)).
59.28/59.61	thf(exuE1, axiom, (exuE1<=>![X1:$i > $o]:(exu @ (^[X2:$i]:X1 @ X2)=>?[X2:$i]:(X1 @ X2&![X3:$i]:(X1 @ X3=>(X2)=(X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', exuE1)).
59.28/59.61	thf(prop2setE, conjecture, (setextAx=>(emptysetAx=>((((((((foundationAx=>(wellorderingAx=>(descrp=>((((![X11:$o, X2:$i]:(X11<=in @ X2 @ (prop2set @ (X11)))<=exuE1)<=dsetconstrER)<=dsetconstrEL)<=dsetconstrI))))<=replAx)<=omegaIndAx)<=omegaSAx)<=omega0Ax)<=setunionAx)<=powersetAx)<=setadjoinAx))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prop2setE)).
59.28/59.61	thf(setextAx, axiom, (setextAx<=>![X4:$i, X5:$i]:(![X2:$i]:(in @ X2 @ X4<=>in @ X2 @ X5)=>(X4)=(X5))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setextAx)).
59.28/59.61	thf(emptysetAx, axiom, (emptysetAx<=>![X2:$i]:~(in @ X2 @ emptyset)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', emptysetAx)).
59.28/59.61	thf(setadjoinAx, axiom, (setadjoinAx<=>![X2:$i, X4:$i, X3:$i]:(in @ X3 @ (setadjoin @ X2 @ X4)<=>((X3)=(X2)|in @ X3 @ X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setadjoinAx)).
59.28/59.61	thf(powersetAx, axiom, (powersetAx<=>![X4:$i, X5:$i]:(in @ X5 @ (powerset @ X4)<=>![X2:$i]:(in @ X2 @ X5=>in @ X2 @ X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', powersetAx)).
59.28/59.61	thf(setunionAx, axiom, (setunionAx<=>![X4:$i, X2:$i]:(in @ X2 @ (setunion @ X4)<=>?[X5:$i]:(in @ X2 @ X5&in @ X5 @ X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setunionAx)).
59.28/59.61	thf(omega0Ax, axiom, (omega0Ax<=>in @ emptyset @ omega), file('/export/starexec/sandbox/benchmark/theBenchmark.p', omega0Ax)).
59.28/59.61	thf(omegaSAx, axiom, (omegaSAx<=>![X2:$i]:(in @ X2 @ omega=>in @ (setadjoin @ X2 @ X2) @ omega)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', omegaSAx)).
59.28/59.61	thf(omegaIndAx, axiom, (omegaIndAx<=>![X4:$i]:((in @ emptyset @ X4&![X2:$i]:((in @ X2 @ omega&in @ X2 @ X4)=>in @ (setadjoin @ X2 @ X2) @ X4))=>![X2:$i]:(in @ X2 @ omega=>in @ X2 @ X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', omegaIndAx)).
59.28/59.61	thf(foundationAx, axiom, (foundationAx<=>![X4:$i]:(?[X2:$i]:in @ X2 @ X4=>?[X5:$i]:(in @ X5 @ X4&~(?[X2:$i]:(in @ X2 @ X5&in @ X2 @ X4))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', foundationAx)).
59.28/59.61	thf(wellorderingAx, axiom, (wellorderingAx<=>![X4:$i]:?[X5:$i]:(((![X7:$i]:(in @ X7 @ X5=>![X2:$i]:(in @ X2 @ X7=>in @ X2 @ X4))&![X2:$i, X3:$i]:((in @ X2 @ X4&in @ X3 @ X4)=>(![X7:$i]:(in @ X7 @ X5=>(in @ X2 @ X7<=>in @ X3 @ X7))=>(X2)=(X3))))&![X7:$i, X8:$i]:((in @ X7 @ X5&in @ X8 @ X5)=>(![X2:$i]:(in @ X2 @ X7=>in @ X2 @ X8)|![X2:$i]:(in @ X2 @ X8=>in @ X2 @ X7))))&![X7:$i]:((![X2:$i]:(in @ X2 @ X7=>in @ X2 @ X4)&?[X2:$i]:in @ X2 @ X7)=>?[X8:$i, X2:$i]:(((in @ X8 @ X5&in @ X2 @ X7)&~(?[X3:$i]:(in @ X3 @ X8&in @ X3 @ X7)))&![X9:$i]:(in @ X9 @ X5=>(![X3:$i]:(in @ X3 @ X9=>in @ X3 @ X8)|in @ X2 @ X9)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', wellorderingAx)).
59.28/59.61	thf(dsetconstrI, axiom, (dsetconstrI<=>![X4:$i, X1:$i > $o, X2:$i]:(in @ X2 @ X4=>(X1 @ X2=>in @ X2 @ (dsetconstr @ X4 @ (^[X3:$i]:X1 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', dsetconstrI)).
59.28/59.61	thf(dsetconstrEL, axiom, (dsetconstrEL<=>![X4:$i, X1:$i > $o, X2:$i]:(in @ X2 @ (dsetconstr @ X4 @ (^[X3:$i]:X1 @ X3))=>in @ X2 @ X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', dsetconstrEL)).
59.28/59.61	thf(dsetconstrER, axiom, (dsetconstrER<=>![X4:$i, X1:$i > $o, X2:$i]:(in @ X2 @ (dsetconstr @ X4 @ (^[X3:$i]:X1 @ X3))=>X1 @ X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', dsetconstrER)).
59.28/59.61	thf(prop2set, axiom, (prop2set)=(^[X10:$o]:dsetconstr @ (powerset @ emptyset) @ (^[X2:$i]:X10)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prop2set)).
59.28/59.61	thf(c_0_19, axiom, (replAx)=(![X6:$i > $i > $o, X4:$i]:(![X2:$i]:(in @ X2 @ X4=>?[X73:$i]:(X6 @ X2 @ X73&![X75:$i]:(X6 @ X2 @ X75=>(X73)=(X75))))=>?[X5:$i]:![X2:$i]:(in @ X2 @ X5<=>?[X3:$i]:(in @ X3 @ X4&X6 @ X3 @ X2)))), inference(apply_def,[status(thm)],[replAx, exu])).
59.28/59.61	thf(c_0_20, axiom, (descrp)=(![X1:$i > $o]:(?[X76:$i]:(X1 @ X76&![X77:$i]:(X1 @ X77=>(X76)=(X77)))=>X1 @ (descr @ (^[X2:$i]:X1 @ X2)))), inference(apply_def,[status(thm)],[descrp, exu])).
59.28/59.61	thf(c_0_21, axiom, (exuE1)=(![X1:$i > $o]:(?[X78:$i]:(X1 @ X78&![X79:$i]:(X1 @ X79=>(X78)=(X79)))=>?[X2:$i]:(X1 @ X2&![X3:$i]:(X1 @ X3=>(X2)=(X3))))), inference(apply_def,[status(thm)],[exuE1, exu])).
59.28/59.61	thf(c_0_22, plain, ![X2:$i, X1:$i > $o]:(epred2_2 @ X1 @ X2<=>X1 @ X2), introduced(definition)).
59.28/59.61	thf(c_0_23, plain, (epred3_0<=>![X4:$i]:?[X5:$i]:(((![X7:$i]:(in @ X7 @ X5=>![X2:$i]:(in @ X2 @ X7=>in @ X2 @ X4))&![X2:$i, X3:$i]:((in @ X2 @ X4&in @ X3 @ X4)=>(![X7:$i]:(in @ X7 @ X5=>(in @ X2 @ X7<=>in @ X3 @ X7))=>(X2)=(X3))))&![X7:$i, X8:$i]:((in @ X7 @ X5&in @ X8 @ X5)=>(![X2:$i]:(in @ X2 @ X7=>in @ X2 @ X8)|![X2:$i]:(in @ X2 @ X8=>in @ X2 @ X7))))&![X7:$i]:((![X2:$i]:(in @ X2 @ X7=>in @ X2 @ X4)&?[X2:$i]:in @ X2 @ X7)=>?[X8:$i, X2:$i]:(((in @ X8 @ X5&in @ X2 @ X7)&~(?[X3:$i]:(in @ X3 @ X8&in @ X3 @ X7)))&![X9:$i]:(in @ X9 @ X5=>(![X3:$i]:(in @ X3 @ X9=>in @ X3 @ X8)|in @ X2 @ X9)))))), introduced(definition)).
59.28/59.61	thf(c_0_24, plain, ![X80:$i, X10:$o]:(epred1_2 @ X10 @ X80<=>X10), introduced(definition)).
59.28/59.61	thf(c_0_25, negated_conjecture, ~((![X4:$i, X5:$i]:(![X2:$i]:(in @ X2 @ X4<=>in @ X2 @ X5)=>(X4)=(X5))=>(![X2:$i]:~in @ X2 @ emptyset=>(![X2:$i, X4:$i, X3:$i]:(in @ X3 @ (setadjoin @ X2 @ X4)<=>((X3)=(X2)|in @ X3 @ X4))=>(![X4:$i, X5:$i]:(in @ X5 @ (powerset @ X4)<=>![X2:$i]:(in @ X2 @ X5=>in @ X2 @ X4))=>(![X4:$i, X2:$i]:(in @ X2 @ (setunion @ X4)<=>?[X5:$i]:(in @ X2 @ X5&in @ X5 @ X4))=>(in @ emptyset @ omega=>(![X2:$i]:(in @ X2 @ omega=>in @ (setadjoin @ X2 @ X2) @ omega)=>(![X4:$i]:((in @ emptyset @ X4&![X2:$i]:((in @ X2 @ omega&in @ X2 @ X4)=>in @ (setadjoin @ X2 @ X2) @ X4))=>![X2:$i]:(in @ X2 @ omega=>in @ X2 @ X4))=>(![X6:$i > $i > $o, X4:$i]:(![X2:$i]:(in @ X2 @ X4=>?[X73:$i]:(X6 @ X2 @ X73&![X75:$i]:(X6 @ X2 @ X75=>(X73)=(X75))))=>?[X5:$i]:![X2:$i]:(in @ X2 @ X5<=>?[X3:$i]:(in @ X3 @ X4&X6 @ X3 @ X2)))=>(![X4:$i]:(?[X2:$i]:in @ X2 @ X4=>?[X5:$i]:(in @ X5 @ X4&~(?[X2:$i]:(in @ X2 @ X5&in @ X2 @ X4))))=>(epred3_0=>(![X1:$i > $o]:(?[X76:$i]:(X1 @ X76&![X77:$i]:(X1 @ X77=>(X76)=(X77)))=>X1 @ (descr @ (epred2_2 @ X1)))=>(![X4:$i, X1:$i > $o, X2:$i]:(in @ X2 @ X4=>(X1 @ X2=>in @ X2 @ (dsetconstr @ X4 @ (epred2_2 @ X1))))=>(![X4:$i, X1:$i > $o, X2:$i]:(in @ X2 @ (dsetconstr @ X4 @ (epred2_2 @ X1))=>in @ X2 @ X4)=>(![X4:$i, X1:$i > $o, X2:$i]:(in @ X2 @ (dsetconstr @ X4 @ (epred2_2 @ X1))=>X1 @ X2)=>(![X1:$i > $o]:(?[X78:$i]:(X1 @ X78&![X79:$i]:(X1 @ X79=>(X78)=(X79)))=>?[X2:$i]:(X1 @ X2&![X3:$i]:(X1 @ X3=>(X2)=(X3))))=>![X11:$o, X2:$i]:(((~X11|in @ X2 @ (prop2set @ $true))&(X11|in @ X2 @ (prop2set @ $false)))=>X11)))))))))))))))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prop2setE]), setextAx]), emptysetAx]), setadjoinAx]), powersetAx]), setunionAx]), omega0Ax]), omegaSAx]), omegaIndAx]), c_0_19]), foundationAx]), wellorderingAx]), c_0_20]), dsetconstrI]), dsetconstrEL]), dsetconstrER]), c_0_21]), c_0_22]), c_0_22]), c_0_22]), c_0_22])])]), c_0_23])).
59.28/59.61	thf(c_0_26, plain, ![X10:$o]:(prop2set @ X10)=(dsetconstr @ (powerset @ emptyset) @ (epred1_2 @ X10)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[prop2set]), c_0_24])).
59.28/59.61	thf(c_0_27, negated_conjecture, ![X82:$i, X83:$i, X85:$i, X86:$i, X87:$i, X88:$i, X89:$i, X90:$i, X91:$i, X92:$i, X93:$i, X95:$i, X96:$i, X98:$i, X99:$i, X100:$i, X101:$i, X102:$i, X104:$i, X105:$i > $i > $o, X106:$i, X108:$i, X111:$i, X113:$i, X114:$i, X115:$i, X116:$i, X118:$i, X119:$i > $o, X120:$i, X122:$i, X123:$i > $o, X124:$i, X125:$i, X126:$i > $o, X127:$i, X128:$i, X129:$i > $o, X130:$i, X131:$i > $o, X132:$i, X135:$i]:(((~in @ (esk1_2 @ X82 @ X83) @ X82|~in @ (esk1_2 @ X82 @ X83) @ X83|(X82)=(X83))&(in @ (esk1_2 @ X82 @ X83) @ X82|in @ (esk1_2 @ X82 @ X83) @ X83|(X82)=(X83)))&(~in @ X85 @ emptyset&(((~in @ X88 @ (setadjoin @ X86 @ X87)|((X88)=(X86)|in @ X88 @ X87))&(((X88)!=(X86)|in @ X88 @ (setadjoin @ X86 @ X87))&(~in @ X88 @ X87|in @ X88 @ (setadjoin @ X86 @ X87))))&(((~in @ X90 @ (powerset @ X89)|(~in @ X91 @ X90|in @ X91 @ X89))&((in @ (esk2_2 @ X92 @ X93) @ X93|in @ X93 @ (powerset @ X92))&(~in @ (esk2_2 @ X92 @ X93) @ X92|in @ X93 @ (powerset @ X92))))&((((in @ X96 @ (esk3_2 @ X95 @ X96)|~in @ X96 @ (setunion @ X95))&(in @ (esk3_2 @ X95 @ X96) @ X95|~in @ X96 @ (setunion @ X95)))&(~in @ X99 @ X100|~in @ X100 @ X98|in @ X99 @ (setunion @ X98)))&(in @ emptyset @ omega&((~in @ X101 @ omega|in @ (setadjoin @ X101 @ X101) @ omega)&((((in @ (esk4_1 @ X102) @ omega|~in @ emptyset @ X102|(~in @ X104 @ omega|in @ X104 @ X102))&(in @ (esk4_1 @ X102) @ X102|~in @ emptyset @ X102|(~in @ X104 @ omega|in @ X104 @ X102)))&(~in @ (setadjoin @ (esk4_1 @ X102) @ (esk4_1 @ X102)) @ X102|~in @ emptyset @ X102|(~in @ X104 @ omega|in @ X104 @ X102)))&(((((in @ (esk8_3 @ X105 @ X106 @ X111) @ X106|~in @ X111 @ (esk7_2 @ X105 @ X106)|in @ (esk5_2 @ X105 @ X106) @ X106)&(X105 @ (esk8_3 @ X105 @ X106 @ X111) @ X111|~in @ X111 @ (esk7_2 @ X105 @ X106)|in @ (esk5_2 @ X105 @ X106) @ X106))&(~in @ X114 @ X106|~X105 @ X114 @ X113|in @ X113 @ (esk7_2 @ X105 @ X106)|in @ (esk5_2 @ X105 @ X106) @ X106))&((((in @ (esk8_3 @ X105 @ X106 @ X111) @ X106|~in @ X111 @ (esk7_2 @ X105 @ X106)|(X105 @ (esk5_2 @ X105 @ X106) @ (esk6_3 @ X105 @ X106 @ X108)|~X105 @ (esk5_2 @ X105 @ X106) @ X108))&(X105 @ (esk8_3 @ X105 @ X106 @ X111) @ X111|~in @ X111 @ (esk7_2 @ X105 @ X106)|(X105 @ (esk5_2 @ X105 @ X106) @ (esk6_3 @ X105 @ X106 @ X108)|~X105 @ (esk5_2 @ X105 @ X106) @ X108)))&(~in @ X114 @ X106|~X105 @ X114 @ X113|in @ X113 @ (esk7_2 @ X105 @ X106)|(X105 @ (esk5_2 @ X105 @ X106) @ (esk6_3 @ X105 @ X106 @ X108)|~X105 @ (esk5_2 @ X105 @ X106) @ X108)))&(((in @ (esk8_3 @ X105 @ X106 @ X111) @ X106|~in @ X111 @ (esk7_2 @ X105 @ X106)|((X108)!=(esk6_3 @ X105 @ X106 @ X108)|~X105 @ (esk5_2 @ X105 @ X106) @ X108))&(X105 @ (esk8_3 @ X105 @ X106 @ X111) @ X111|~in @ X111 @ (esk7_2 @ X105 @ X106)|((X108)!=(esk6_3 @ X105 @ X106 @ X108)|~X105 @ (esk5_2 @ X105 @ X106) @ X108)))&(~in @ X114 @ X106|~X105 @ X114 @ X113|in @ X113 @ (esk7_2 @ X105 @ X106)|((X108)!=(esk6_3 @ X105 @ X106 @ X108)|~X105 @ (esk5_2 @ X105 @ X106) @ X108)))))&(((in @ (esk9_1 @ X115) @ X115|~in @ X116 @ X115)&(~in @ X118 @ (esk9_1 @ X115)|~in @ X118 @ X115|~in @ X116 @ X115))&(epred3_0&(((X119 @ (esk10_2 @ X119 @ X120)|~X119 @ X120|X119 @ (descr @ (epred2_2 @ X119)))&((X120)!=(esk10_2 @ X119 @ X120)|~X119 @ X120|X119 @ (descr @ (epred2_2 @ X119))))&((~in @ X124 @ X122|(~X123 @ X124|in @ X124 @ (dsetconstr @ X122 @ (epred2_2 @ X123))))&((~in @ X127 @ (dsetconstr @ X125 @ (epred2_2 @ X126))|in @ X127 @ X125)&((~in @ X130 @ (dsetconstr @ X128 @ (epred2_2 @ X129))|X129 @ X130)&((((X131 @ (esk12_1 @ X131)|(X131 @ (esk11_2 @ X131 @ X132)|~X131 @ X132))&(~X131 @ X135|(esk12_1 @ X131)=(X135)|(X131 @ (esk11_2 @ X131 @ X132)|~X131 @ X132)))&((X131 @ (esk12_1 @ X131)|((X132)!=(esk11_2 @ X131 @ X132)|~X131 @ X132))&(~X131 @ X135|(esk12_1 @ X131)=(X135)|((X132)!=(esk11_2 @ X131 @ X132)|~X131 @ X132))))&(((~epred4_0|in @ esk13_0 @ (prop2set @ $true))&(epred4_0|in @ esk13_0 @ (prop2set @ $false)))&~epred4_0))))))))))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])])])])).
59.28/59.61	thf(c_0_28, plain, ![X81:$o]:(prop2set @ X81)=(dsetconstr @ (powerset @ emptyset) @ (epred1_2 @ X81)), inference(variable_rename,[status(thm)],[c_0_26])).
59.28/59.61	thf(c_0_29, negated_conjecture, ![X3:$i, X2:$i, X1:$i > $o]:(in @ X2 @ X3|~in @ X2 @ (dsetconstr @ X3 @ (epred2_2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_27])).
59.28/59.61	thf(c_0_30, plain, ![X10:$o]:(prop2set @ X10)=(dsetconstr @ (powerset @ emptyset) @ (epred1_2 @ X10)), inference(split_conjunct,[status(thm)],[c_0_28])).
59.28/59.61	thf(c_0_31, negated_conjecture, (epred4_0|in @ esk13_0 @ (prop2set @ $false)), inference(split_conjunct,[status(thm)],[c_0_27])).
59.28/59.61	thf(c_0_32, negated_conjecture, ~epred4_0, inference(split_conjunct,[status(thm)],[c_0_27])).
59.28/59.61	thf(c_0_33, plain, ![X1:$i > $o, X2:$i, X10:$o]:(in @ X2 @ (powerset @ emptyset)|(epred1_2 @ X10)!=(epred2_2 @ X1)|~in @ X2 @ (prop2set @ X10)), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_29, c_0_30])])).
59.28/59.61	thf(c_0_34, negated_conjecture, in @ esk13_0 @ (prop2set @ $false), inference(sr,[status(thm)],[c_0_31, c_0_32])).
59.28/59.61	thf(c_0_35, negated_conjecture, ![X1:$i > $o]:(in @ esk13_0 @ (powerset @ emptyset)|(epred1_2 @ $false)!=(epred2_2 @ X1)), inference(spm,[status(thm)],[c_0_33, c_0_34])).
59.28/59.61	thf(c_0_36, plain, ![X138:$i, X139:$o]:((~epred1_2 @ X139 @ X138|X139)&(~X139|epred1_2 @ X139 @ X138)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])).
59.28/59.61	thf(c_0_37, plain, ![X140:$i, X141:$i > $o]:((~epred2_2 @ X141 @ X140|X141 @ X140)&(~X141 @ X140|epred2_2 @ X141 @ X140)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])).
59.28/59.61	thf(c_0_38, negated_conjecture, ![X1:$i > $o]:(in @ esk13_0 @ (powerset @ emptyset)|(epred1_2 @ $false @ (esk20_1 @ X1))!=(epred2_2 @ X1 @ (esk20_1 @ X1))), inference(neg_ext,[status(thm)],[c_0_35])).
59.28/59.61	thf(c_0_39, plain, ![X2:$i]:~epred1_2 @ $false @ X2, inference(eliminate_boolean_vars,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_36])])])).
59.28/59.61	thf(c_0_40, plain, ![X1:$i > $o, X2:$i]:(X1 @ X2|~epred2_2 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_37])).
59.28/59.61	thf(c_0_41, negated_conjecture, ![X1:$i > $o]:(in @ esk13_0 @ (powerset @ emptyset)|epred2_2 @ X1 @ (esk20_1 @ X1)), inference(sr,[status(thm)],[inference(dynamic cnf,[status(thm)],[c_0_38]), c_0_39])).
59.28/59.61	thf(c_0_42, plain, ![X1:$i > $o]:(in @ esk13_0 @ (powerset @ emptyset)|X1 @ (esk20_1 @ X1)), inference(spm,[status(thm)],[c_0_40, c_0_41])).
59.28/59.61	thf(c_0_43, negated_conjecture, ![X4:$i, X3:$i, X2:$i]:(in @ X4 @ X3|~in @ X2 @ (powerset @ X3)|~in @ X4 @ X2), inference(split_conjunct,[status(thm)],[c_0_27])).
59.28/59.61	thf(c_0_44, plain, in @ esk13_0 @ (powerset @ emptyset), inference(spm,[status(thm)],[c_0_39, c_0_42])).
59.28/59.61	thf(c_0_45, negated_conjecture, ![X2:$i]:~in @ X2 @ emptyset, inference(split_conjunct,[status(thm)],[c_0_27])).
59.28/59.61	thf(c_0_46, negated_conjecture, ![X2:$i]:~in @ X2 @ esk13_0, inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_45])).
59.28/59.61	thf(c_0_47, negated_conjecture, ![X2:$i, X3:$i]:(in @ (esk1_2 @ X2 @ X3) @ X2|in @ (esk1_2 @ X2 @ X3) @ X3|(X2)=(X3)), inference(split_conjunct,[status(thm)],[c_0_27])).
59.28/59.61	thf(c_0_48, negated_conjecture, ![X2:$i]:((esk13_0)=(X2)|in @ (esk1_2 @ esk13_0 @ X2) @ X2), inference(spm,[status(thm)],[c_0_46, c_0_47])).
59.28/59.61	thf(c_0_49, negated_conjecture, ![X3:$i, X2:$i, X1:$i > $o]:(X1 @ X2|~in @ X2 @ (dsetconstr @ X3 @ (epred2_2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_27])).
59.28/59.61	thf(c_0_50, negated_conjecture, (esk13_0)=(emptyset), inference(spm,[status(thm)],[c_0_45, c_0_48])).
59.28/59.61	thf(c_0_51, plain, ![X1:$i > $o, X2:$i, X10:$o]:(X1 @ X2|(epred1_2 @ X10)!=(epred2_2 @ X1)|~in @ X2 @ (prop2set @ X10)), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_49, c_0_30])])).
59.28/59.61	thf(c_0_52, negated_conjecture, in @ emptyset @ (prop2set @ $false), inference(rw,[status(thm)],[c_0_34, c_0_50])).
59.28/59.61	thf(c_0_53, negated_conjecture, ![X1:$i > $o]:(X1 @ emptyset|(epred1_2 @ $false)!=(epred2_2 @ X1)), inference(spm,[status(thm)],[c_0_51, c_0_52])).
59.28/59.61	thf(c_0_54, negated_conjecture, ![X1:$i > $o]:(X1 @ emptyset|(epred1_2 @ $false @ (esk23_1 @ X1))!=(epred2_2 @ X1 @ (esk23_1 @ X1))), inference(neg_ext,[status(thm)],[c_0_53])).
59.28/59.61	thf(c_0_55, negated_conjecture, ![X1:$i > $o]:(epred2_2 @ X1 @ (esk23_1 @ X1)|X1 @ emptyset), inference(sr,[status(thm)],[inference(dynamic cnf,[status(thm)],[c_0_54]), c_0_39])).
59.28/59.61	thf(c_0_56, plain, ($false), inference(flex_resolve,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_55])]), ['proof']).
59.28/59.61	# SZS output end CNFRefutation
59.28/59.61	# Proof object total steps             : 57
59.28/59.61	# Proof object clause steps            : 26
59.28/59.61	# Proof object formula steps           : 31
59.28/59.61	# Proof object conjectures             : 21
59.28/59.61	# Proof object clause conjectures      : 18
59.28/59.61	# Proof object formula conjectures     : 3
59.28/59.61	# Proof object initial clauses used    : 10
59.28/59.61	# Proof object initial formulas used   : 19
59.28/59.61	# Proof object generating inferences   : 8
59.28/59.61	# Proof object simplifying inferences  : 8
59.28/59.61	# Training examples: 0 positive, 0 negative
59.28/59.61	# Parsed axioms                        : 45
59.28/59.61	# Removed by relevancy pruning/SinE    : 0
59.28/59.61	# Initial clauses                      : 85
59.28/59.61	# Removed in clause preprocessing      : 26
59.28/59.61	# Initial clauses in saturation        : 59
59.28/59.61	# Processed clauses                    : 428
59.28/59.61	# ...of these trivial                  : 6
59.28/59.61	# ...subsumed                          : 130
59.28/59.61	# ...remaining for further processing  : 291
59.28/59.61	# Other redundant clauses eliminated   : 10
59.28/59.61	# Clauses deleted for lack of memory   : 0
59.28/59.61	# Backward-subsumed                    : 3
59.28/59.61	# Backward-rewritten                   : 54
59.28/59.61	# Generated clauses                    : 1996
59.28/59.61	# ...of the previous two non-trivial   : 1933
59.28/59.61	# Contextual simplify-reflections      : 0
59.28/59.61	# Paramodulations                      : 1956
59.28/59.61	# Factorizations                       : 14
59.28/59.61	# NegExts                              : 5
59.28/59.61	# Equation resolutions                 : 10
59.28/59.61	# Propositional unsat checks           : 0
59.28/59.61	#    Propositional check models        : 0
59.28/59.61	#    Propositional check unsatisfiable : 0
59.28/59.61	#    Propositional clauses             : 0
59.28/59.61	#    Propositional clauses after purity: 0
59.28/59.61	#    Propositional unsat core size     : 0
59.28/59.61	#    Propositional preprocessing time  : 0.000
59.28/59.61	#    Propositional encoding time       : 0.000
59.28/59.61	#    Propositional solver time         : 0.000
59.28/59.61	#    Success case prop preproc time    : 0.000
59.28/59.61	#    Success case prop encoding time   : 0.000
59.28/59.61	#    Success case prop solver time     : 0.000
59.28/59.61	# Current number of processed clauses  : 173
59.28/59.61	#    Positive orientable unit clauses  : 15
59.28/59.61	#    Positive unorientable unit clauses: 0
59.28/59.61	#    Negative unit clauses             : 3
59.28/59.61	#    Non-unit-clauses                  : 155
59.28/59.61	# Current number of unprocessed clauses: 1534
59.28/59.61	# ...number of literals in the above   : 5088
59.28/59.61	# Current number of archived formulas  : 0
59.28/59.61	# Current number of archived clauses   : 117
59.28/59.61	# Clause-clause subsumption calls (NU) : 4670
59.28/59.61	# Rec. Clause-clause subsumption calls : 2763
59.28/59.61	# Non-unit clause-clause subsumptions  : 47
59.28/59.61	# Unit Clause-clause subsumption calls : 380
59.28/59.61	# Rewrite failures with RHS unbound    : 0
59.28/59.61	# BW rewrite match attempts            : 39
59.28/59.61	# BW rewrite match successes           : 4
59.28/59.61	# Condensation attempts                : 0
59.28/59.61	# Condensation successes               : 0
59.28/59.61	# Termbank termtop insertions          : 45078
59.28/59.61	
59.28/59.61	# -------------------------------------------------
59.28/59.61	# User time                : 58.039 s
59.28/59.61	# System time              : 1.132 s
59.28/59.61	# Total time               : 59.172 s
59.28/59.61	# Maximum resident set size: 1700 pages
59.28/59.62	EOF
